// 2025/4/28
// 笨小猴

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

bool isPrime(int n)
{
    if(n < 2) return false;
    for(int i = 2; i <= sqrt(n); i++)
    {
        if(n % i == 0)
            return false;
    }
    return true;
}

int main() {
    string str; cin >> str;
    vector<int> abcs(26, 0);
    for(auto ch : str)
    {
        ++abcs[ch - 'a'];
    }
    int maxn = 0, minn = str.size();
    for(auto num : abcs)
    {
        maxn = max(num, maxn);
        if(num != 0)
            minn = min(num, minn);
    }
    if(isPrime(maxn - minn))
    {
        cout << "Lucky Word" << endl;
        cout << maxn - minn << endl;
    }
    else 
    {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")